Resolving Complement Anaphora

نویسنده

  • Hadas KOTEK
چکیده

In a quantified expression, the possibility of referring to the set-theoretical difference of restrictor and scope is known as complement anaphora (CA). Existing literature suggests two ways of analyzing this phenomenon either as confusion with reference to the maximal set, or as genuine complement reference. This paper will show that resolving an anaphor to the complement set is never a viable option. This will be motivated by adopting a formal semantic approach based on optimalitytheoretic constraints. Crucially, CA is licensed only by proportional right monotone decreasing determiners. Since proportional determiners introduce their restrictors into the discourse via an accommodated presupposition, the maximal set will always serve as a better candidate for anaphora resolution than the complement set. Further support of this conclusion stems from an independent maximality effect of CA, which follows naturally from the proposed analysis.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Acquisition Model for both Choosing and Resolving Anaphora in Conjoined Mandarin Chinese Sentences

Anaphoric reference is an important linguistic phenomenon to understand the discourse structure and content. In Chinese natural language processing, there are both the problems of choosing and resolving anaphora. In Mandarin Chinese, several linguists have attempted to propose criteria to ezplain the phenomenon of anaphora but with controversial results. On the other hand, search-based computat...

متن کامل

Resolving and Generating Definite Anaphora by Modeling Hypernymy using Unlabeled Corpora

We demonstrate an original and successful approach for both resolving and generating definite anaphora. We propose and evaluate unsupervised models for extracting hypernym relations by mining cooccurrence data of definite NPs and potential antecedents in an unlabeled corpus. The algorithm outperforms a standard WordNet-based approach to resolving and generating definite anaphora. It also substa...

متن کامل

Machine Learning Approach for Resolving Pronominal Anaphora Using Hindi Dependency Treebank

Machine Learning facilitates the computers to mimic human intelligence by applying a set of rules to massive amounts of trained data and identifying patterns to make decisions and adapt based on what patterns are still uncovered. A number of applications ranging from spam detection, facial recognition, product recommendations to credit-card fraud detection, all of them apply machine learning pr...

متن کامل

The Interpretation of Complement Anaphorae: the case of The Others

This paper presents an experimental study on the interpretation of the complement anaphora the others in inter-sentential discourse. It aims to offer an answer to the following two empirical questions. First, how complement anaphora denote the “complement set”, a set of referents that includes those referents not denoted by the matching anaphoric antecedent. Second, what are the exact interpret...

متن کامل

Exploring Semantic Information from Hindi Dependency Treebank for Resolving Pronominal Anaphora

Anaphora Resolution is exigent task in almost all NLP applications such as text summarization, machine translation, information extraction, question-answering systems, etc. A lot of work has been done for identifying and still more need to be done for finding the factors responsible for resolving the anaphoras in all languages. An attempt has been made to resolve Hindi pronominal anaphora using...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008